Finite-tree analysis for constraint logic-based languages

Finite-Tree Analysis for Constraint Logic-Based Languages

Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of the occurs-check) and increased expressivity. Note that cyclic terms can provide a very efficient representation of grammars and other useful objects. Unfortunately, the use of infinite rational trees has problems. For instance, m...

An Efficient and Precise Finite-Tree Analysis for Constraint Logic-Based Languages

projection on the composite domain H × P is much simpler thanabstract unification, because in this case there is no interaction between the twocomponents of the abstract domain. Definition 20. (Abstract projection on H×P .) The function projH : H×VI → H captures the effects, on the H component, of projecting away a variable.For each h ∈ H and x ∈ VI , projH(h, x) def= h ∪ {x...

A pr 2 00 4 Finite - Tree Analysis for Constraint Logic - Based Languages : The Complete

Logic languages based on the theory of rational, possibly infinite, trees have muchappeal in that rational trees allow for faster unification (due to the safe omission ofthe occurs-check) and increased expressivity (cyclic terms can provide very efficientrepresentations of grammars and other useful objects). Unfortunately, the use ofinfinite rational trees has problems. For inst...

Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version

Logic languages based on the theory of rational, possibly infinite, trees have muchappeal in that rational trees allow for faster unification (due to the safe omission ofthe occurs-check) and increased expressivity (cyclic terms can provide very efficientrepresentations of grammars and other useful objects). Unfortunately, the use ofinfinite rational trees has problems. For inst...

Finite - Tree Analysisfor Constraint Logi - Based Languages ?